Cube{root Boundary Fluctuations for Droplets in Random Cluster Models

نویسنده

  • KENNETH S. ALEXANDER
چکیده

For a family of bond percolation models on Z that includes the FortuinKasteleyn random cluster model, we consider properties of the “droplet” that results, in the percolating regime, from conditioning on the existence of an open dual circuit surrounding the origin and enclosing at least (or exactly) a given large area A. This droplet is a close surrogate for the one obtained by Dobrushin, Kotecký and Shlosman by conditioning the Ising model; it approximates an area-A Wulff shape. The local part of the deviation from the Wulff shape (the “local roughness”) is the inward deviation of the droplet boundary from the boundary of its own convex hull; the remaining part of the deviation, that of the convex hull of the droplet from the Wulff shape, is inherently long-range. We show that the local roughness is described by at most the exponent 1/3 predicted by nonrigorous theory; this same prediction has been made for a wide class of interfaces in two dimensions. Specifically, the average of the local roughness over the droplet surface is shown to be O(l(log l)) in probability, where l = √ A is the linear scale of the droplet. We also bound the maximum of the local roughness over the droplet surface and bound the long-range part of the deviation from a Wulff shape, and we establish the absense of “bottlenecks,” which are a form of self-approach by the droplet boundary, down to scale log l. Finally, if we condition instead on the event that the total area of all large droplets inside a finite box exceeds A, we show that with probability near 1 for large A, only a single large droplet is present.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large-eddy simulation of turbulent flow over an array of wall-mounted cubes submerged in an emulated atmospheric boundary-layer

Turbulent flow over an array of wall-mounted cubic obstacles has been numerically investigated using large-eddy simulation. The simulations have been performed using high-performance computations with local cluster systems. The array of cubes are fully submerged in a simulated deep rough-wall atmospheric boundary-layer with high turbulence intensity characteristics of environmental turbulent fl...

متن کامل

Cube root fluctuations for the corner growth model associated to the exclusion process

We study the last-passage growth model on the planar integer lattice with exponential weights. With boundary conditions that represent the equilibrium exclusion process as seen from a particle right after its jump we prove that the variance of the last-passage time in a characteristic direction is of order t. With more general boundary conditions that include the rarefaction fan case we show th...

متن کامل

Coprocessing Architecture in System-on- programmable-chip for Monte Carlo Simulation

Monte Carlo simulation is mainly done in computer clusters, supercomputers or computers coupled with hardware accelerators. These processing methods are sufficiently fast; however, this speed comes at the expense of physical area and power consumption. The current study aims to use System-OnProgrammable-Chip (SOPC) to accomplish the same task but using a smaller physical area. The SOPC approach...

متن کامل

A Growth Model in a Random Environment

Abstract. We consider a model of interface growth in two dimensions, given by a height function on the sites of the one–dimensional integer lattice. According to the discrete time update rule, the height above the site x increases to the height above x − 1, if the latter height is larger; otherwise the height above x increases by 1 with probability px. We assume that px are chosen independently...

متن کامل

A Growth Model in a Random Environment1 by Janko Gravner,

We consider a model of interface growth in two dimensions, given by a height function on the sites of the one-dimensional integer lattice. According to the discrete time update rule, the height above the site x increases to the height above x − 1, if the latter height is larger; otherwise the height above x increases by 1 with probability px . We assume that px are chosen independently at rando...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000